Finite-Time Attractivity for Diagonally Dominant Systems with Off-Diagonal Delays
نویسنده
چکیده
and Applied Analysis 3 where T is a given positive constant, aij : R → R, i, j 1, . . . , d, are continuous functions and τij > 0 for i, j 1, . . . , d with i / j. Define r : max { τij : i, j 1, . . . , d, i / j } . 2.2 Note that 2.1 is a special case of 1.2 . More precisely, the right hand side of 2.1 equals f t, xt , where f f1, . . . , fd : 0, T × C → R is defined as follows: fi ( t, φ ) : aii t φ 0 d ∑ j 1,j / i aij t φj (−τij ) . 2.3 Let S : 0, T × C → C denote the evolution operator of 2.1 . From 2.3 , we see that the function f is linear in the second argument. Therefore, the evolution operator S is also linear in the second argument. Our aim in this section is to provide a sufficient condition for the finite-time attractivity for the zero solution of 2.1 and thus for all solutions of 2.1 , see Remark 1.2. Before presenting the main result, we recall the notion of row diagonal dominance. We refer the reader to 14, Definition 7.10 for a discussion of this notion. System 2.1 is called row diagonally dominant if there exists a positive constant δ such that
منابع مشابه
Diagonal Dominance and Harmless Off-diagonal Delays
Systems of linear differential equations with constant coefficients, as well as Lotka–Volterra equations, with delays in the off–diagonal terms are considered. Such systems are shown to be asymptotically stable for any choice of delays if and only if the matrix has a negative weakly dominant diagonal.
متن کاملDiagonal Dominance and Harmless O -Diagonal Delays1
Systems of linear diierential equations with constant coeecients, as well as Lotka{Volterra equations, with delays in the oo{diagonal terms are considered. Such systems are shown to be asymptotically stable for any choice of delays if and only if the matrix has a negative weakly dominant diagonal.
متن کاملRelative Perturbation Bounds for Eigenvalues of Symmetric Positive Definite Diagonally Dominant Matrices
For a symmetric positive semi-definite diagonally dominant matrix, if its off-diagonal entries and its diagonally dominant parts for all rows (which are defined for a row as the diagonal entry subtracted by the sum of absolute values of off-diagonal entries in that row) are known to a certain relative accuracy, we show that its eigenvalues are known to the same relative accuracy. Specifically, ...
متن کاملComputing singular values of diagonally dominant matrices to high relative accuracy
For a (row) diagonally dominant matrix, if all of its off-diagonal entries and its diagonally dominant parts (which are defined for each row as the absolute value of the diagonal entry subtracted by the sum of the absolute values of off-diagonal entries in that row) are accurately known, we develop an algorithm that computes all the singular values, including zero ones if any, with relative err...
متن کاملEla Accurate and Efficient Ldu Decompositions of Diagonally Dominant M-matrices
An efficient method for the computation to high relative accuracy of the LDU decomposition of an n × n row diagonally dominant M–matrix is presented, assuming that the off–diagonal entries and row sums are given. This method costs an additional O(n) elementary operations over the cost of Gaussian elimination, and leads to a lower triangular, column diagonally dominant matrix and an upper triang...
متن کامل